Average distances on self-similar sets and higher order average distances of self-similar measures

Average Distances of Pyramid Networks

For an interconnection network, calculating average distance of it is in general more difficult than determining its diameter. Diameters of pyramid networks are well known. This study calculates average distances of pyramid networks.

Self-Similar Measures

Self-similar Measures and Intersections of Cantor Sets

It is natural to expect that the arithmetic sum of two Cantor sets should have positive Lebesgue measure if the sum of their dimensions exceeds 1, but there are many known counterexamples, e.g. when both sets are the middle-α Cantor set and α ∈ ( 1 3 , 1 2 ). We show that for any compact set K and for a.e. α ∈ (0, 1), the arithmetic sum of K and the middle-α Cantor set does indeed have positive...

Computability of the Hausdorff and packing measures on self-similar sets and the self-similar tiling principle

We state a self-similar tiling principle which shows that any open subset of a self-similar set with open set condition may be tiled without loss of measure by copies under similitudes of any closed subset with positive measure. We use this method to get the optimal coverings and packings which give the exact value of the Hausdorff-type and packing measures. In particular, we show that the exac...

Computability of Self-Similar Sets

We investigate computability of a self-similar set on a Euclidean space. A nonempty compact subset of a Euclidean space is called a self-similar set if it equals to the union of the images of itself by some set of contractions. The main result in this paper is that if all of the contractions are computable, then the self-similar is a recursive compact set. A further result on the case that the ...